The Data structure is one of the main concept in computer science. As the name implies itself data structure is to give a structure to data. In simple words, It will help us to organize or manage storage in particular format such that enables efficient use of main storage and modification.
A Data structure is a special format for organizing and storing data. In another word more precisely. It is a collection of data values the relationship among them or operations that can be applied to the data.
General data structures types include Arrays, Files, Linked list, Stacks, Queue, trees, graphs and
so on.
Depending upon the usage particular data structure is used the factors promote to decide which
data structure is used in particular scenario and depend upon the organization of the elements.
Data structures are classified into two types
1. Linear data structure :
In this type of data structure the data a store in Linea fashion that's elements can be assessed
in sequential order
for examples : Arrays, linked list, stacks, Queue
2 Non Linear structure
In non linear data structures elements of this data structure are stored in a linear non linear order
For example : trees and graphs
Abstract Data types (ADTs)
For all user defined data types there is need to define operations. The basic operation are addition, subtraction. All prmitive data types such as int, float etc support these opeartions.
In general, user defined data types are defined along with their operations. In order to simplify the process of solving problems, There is need to combine the data structures with their operation and this is called as Abstract data type.
An ADT is consist of two parts:
1. Declaration of data
2. Declaration of operations.
For coding books,Follow
The book name here
No comments:
Post a Comment